Protecting Gay and Lesbian Families From Eviction From Their Homes: The Quest for Equality for Gay and Lesbian Families in Braschi v. Stahl Associates

As indicated above, much of the Author\u27s professional life has been involved in writing about and litigating Braschi-related matters. However, the theme of this Conference-how law and its practitioners affect issues of freedom, equality, and justice-has given the Author the opportunity to begin to address questions raised when the Author first watched the tape of the Braschi oral argument and then read the ACLU briefs, but which the Author has not had the opportunity to address since then. Those questions are: 1) What role did Braschi\u27s lawyers play in the Court\u27s formulation of a functional definition of family? 2) Was the Braschi Court fearlessly entering a brave new world of gay and lesbian equality, leading the legal system into a recognition of same-sex families, or was it playing catch-up, i.e., recognizing what had already become the social and cultural reality of functional families-gay, lesbian, and other? The Author\u27s presentation at the conference on these questions, which is somewhat further developed here, was an attempt to begin to sketch the contours of answers to those questions

The Araucaria Project. Bright Variable Stars in NGC 6822 from a Wide-Field Imaging Survey

We have performed a search for variable stars in the dwarf irregular galaxy NGC 6822 using wide-field multi-epoch VI photometry down to a limiting magnitude $V$ $\sim$ 22. Apart from the Cepheid variables in this galaxy already reported in an earlier paper by Pietrzynski et al. (2004), we have found 1019 "non-periodic" variable stars, 50 periodically variable stars with periods ranging from 0.12 to 66 days and 146 probably periodic variables. Twelve of these stars are eclipsing binaries and fifteen are likely new, low-amplitude Cepheids. Interestingly, seven of these Cepheid candidates have periods longer than 100 days, have very low amplitudes (less than 0.2 mag in $I$), and are very red. They could be young, massive Cepheids still embedded in dusty envelopes. The other objects span a huge range in colours and represent a mixture of different types of luminous variables. Many of the variables classified as non-periodic in the present study may turn out to be {\it periodic} variables once a much longer time baseline will be available to study them. We provide the catalogue of photometric parameters and show the atlas of light curves for the new variable stars. Our present catalogue is complementary to the one of Baldacci et al. (2005) which has focussed on very short-period and fainter variables in a subfield in NGC 6822.Comment: Accepted for publication in A&

Robustness of solutions to the capacitated facility location problem with uncertain demand

We investigate the properties of robust solutions of the Capacitated Facility Location Problem with uncertain demand. We show that the monotonic behavior of the price of robustness is not guaranteed, and therefore that one cannot discriminate among alternative robust solutions by simply relying on the trade-off price-vs-robustness. Furthermore, we report a computational study on benchmark instances from the literature and on instances derived from a real-world application, which demonstrates the validity in practice of our findings

The electric two-echelon vehicle routing problem

Two-echelon distribution systems are attractive from an economical standpoint and help to keep large vehicles out of densely populated city centers. Large trucks can be used to deliver goods to intermediate facilities in accessible locations, whereas smaller vehicles allow to reach the final customers. Due to their reduced size, pollution, and noise, multiple companies consider using an electric fleet of terrestrial or aerial vehicles for last-mile deliveries. Route planning in multi-tier logistics leads to notoriously difficult problems. This difficulty is accrued in the presence of an electric fleet since each vehicle operates on a smaller range and may require planned visits to recharging stations. To study these challenges, we introduce the electric two-echelon vehicle routing problem (E2EVRP) as a prototypical problem. We propose a large neighborhood search (LNS) metaheuristic as well as an exact mathematical programming algorithm, which uses decomposition techniques to enumerate promising first-level solutions in conjunction with bounding functions and route enumeration for the second-level routes. These algorithms produce optimal or near-optimal solutions for the problem and allow us to evaluate the impact of several defining features of optimized battery-powered distribution networks. We created representative E2EVRP benchmark instances to simulate realistic metropolitan areas. In particular, we observe that the detour miles due to recharging decrease proportionally to 1/ρx with x ≈ 5/4 as a function of the charging stations density ρ; e.g., in a scenario where the density of charging stations is doubled, recharging detours are reduced by 58%. Finally, we evaluate the trade-off between battery capacity and detour miles. This estimate is critical for strategic fleet-acquisition decisions, in a context where large batteries are generally more costly and less environment-friendly

Vehicle routing problems with drones equipped with multi-package payload compartments

The vehicle routing problem with drones (VRP-D) consists of designing combined truck-drone routes and schedules to serve a set of customers with specific requests and time constraints. In this paper, VRP-D is extended to include a fleet of drones equipped with multi-package payload compartments to serve more customers on a single trip. Moreover, a drone can return to a truck, different from the one from which it started, to swap its depleted battery and/or to pick up more packages. This problem, denoted as VRP-D equipped with multi-package payload compartments (VRP-D-MC), aims to maximize total profit. In this work, an adaptive multi-start simulated annealing (AMS-SA) metaheuristic algorithm is proposed to efficiently solve this problem. Experimental results show that the proposed algorithm outperforms the current state-of-the-art algorithms for VRP-D in terms of solution quality. Extensive analyses have been conducted to provide managerial insights. The analyses carried out show (i) the benefits of using drones equipped with different compartment configurations, (ii) the incremental total profit obtainable using a combined truck-drone fleet rather than a fleet of trucks, (iii) the benefit of swapping drone battery while picking up the items to deliver, and (iv) the impact of the packages load on the consumption energy of battery drone. It is also demonstrated that the different intensification and diversification mechanisms adopted improve the convergence of the traditional SA

The bus sightseeing problem

The basic characteristic of vehicle routing problems with profits (VRPP) is that locations to be visited are not predetermined. On the contrary, they are selected in pursuit of maximizing the profit collected from them. Significant research focus has been directed toward profitable routing variants due to the practical importance of their applications and their interesting structure, which jointly optimizes node selection and routing decisions. Profitable routing applications arise in the tourism industry aiming to maximize the profit score of attractions visited within a limited time period. In this paper, a new VRPP is introduced, referred to as the bus sightseeing problem (BSP). The BSP calls for determining bus tours for transporting different groups of tourists with different preferences on touristic attractions. Two interconnected decision levels have to be jointly tackled: assignment of tourists to buses and routing of buses to the various attractions. A mixed-integer programming formulation for the BSP is provided and solved by a Benders decomposition algorithm. For large-scale instances, an iterated local search based metaheuristic algorithm is developed with some tailored neighborhood operators. The proposed methods are tested on a large family of test instances, and the obtained computational results demonstrate the effectiveness of the proposed solution approaches